A Variable Neighborhood Search approach for the aircraft conflict resolution problem

نویسندگان

  • Antonio Alonso-Ayuso
  • Laureano F. Escudero
  • F. Javier Martín-Campo
  • Nenad Mladenović
چکیده

A metaheuristic approach based on Variable Neighborhood Search to tackle the enroute aircraft conflict resolution problem is presented. The three maneuvers (velocity, heading angle and altitude level variations) are allowed to be performed. Based on geometric rules, we can determine if a conflict situation occurs between each pair of aircraft under consideration. As three different maneuvers could be performed, they are dealt with in a multiobjective framework, allowing Air Traffic Control officers to make the final decision based on economic and comfort terms. Air Traffic Management; aircraft conflict avoidance; Variable Neighborhood Search; multiobjective optimization

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm

The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...

متن کامل

Investigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm

In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...

متن کامل

A Hybrid Meta-heuristic for the Dynamic Layout Problem with Transportation System Design

This paper primarily presents a comprehensive dynamic layout design model which integrates layout and transportation system design via considering more realistic assumptions, such as taking account of fixed-position departments and distance between departments that endanger each other. In addition, specific criteria such as capacity, cost and reliability of facilities are considered in transpor...

متن کامل

An improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine

In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...

متن کامل

A Two-Phase Hybrid Heuristic Method for a Multi-Depot Inventory-Routing Problem

In this study, a two phase hybrid heuristic approach was proposed to solve the multi-depot multi-vehicle inventory routing problem (MDMVIRP). Inventory routing problem (IRP) is one of the major issues in the supply chain networks that arise in the context of vendor managed systems (VMI) The MDMVIRP combines inventory management and routing decision. We are given on input a fleet of homogeneous ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016